Multi-parameter Polynomials with Given Galois Group
نویسنده
چکیده
The non-Abelian finite simple groups and their automorphism groups play a crucial role in an inductive approach to the inverse problem of Galois theory. The rigidity method (see, for example, Malle and Matzat, 1999) has proved very efficient for deducing the existence of Galois extensions with such groups, as well as for the construction of polynomials generating such extensions. Nevertheless, the effective construction requires the solution of a nonlinear system of equations, a problem which is known to be very hard from a complexity point of view. Thus, in practice, the computation of polynomials is restricted to rather small degree, to the case of stem fields of genus zero and also to few (mostly three) ramification points. For several applications, for example for the solution of embedding problems, it is sometimes necessary to find Galois extensions of the rationals with given group and with complex conjugation lying in a prescribed conjugacy class. But it is well known (see, for example, Malle and Matzat, 1999, Example I.10.2) that three-point ramified Galois extensions almost never have totally real specializations, for example. In this paper we give two-, threeand four-parameter polynomials for certain (mostly non-solvable) groups which, from a certain point of view, correspond to Galois extensions ramified in at least four points, with the property that these admit (infinitely many) totally real, Galois group preserving specializations. For example we obtain a two-parameter polynomial for the sporadic simple Mathieu group M12 over Q. Suitable specializations then yield totally real number fields with groups M11 and M12.
منابع مشابه
Galois Groups of Polynomials Arising from Circulant Matrices
Computing the Galois group of the splitting field of a given polynomial with integer coefficients is a classical problem in modern algebra. A theorem of Van der Waerden [Wae] asserts that almost all (monic) polynomials in Z[x] have associated Galois group Sn, the symmetric group on n letters. Thus, cases where the associated Galois group is different from Sn are rare. Nevertheless, examples of ...
متن کاملGalois Groups of p-Adic Polynomials of Fixed Degree
Given an integer n and a group G we estimate the probability that a random, monic, degree n, p-adic polynomial has Galois group isomorphic to G. A comparison is made with classic results concerning Galois groups of random, monic, degree n polynomials with integer coefficients. We conclude by analyzing the probability that a random, monic, degree n polynomial in Z[x] has these properties: its Ga...
متن کاملDeciding the nilpotency of the Galois group by computing elements in the centre
We present a new algorithm for computing the centre of the Galois group of a given polynomial f ∈ Q[x] along with its action on the set of roots of f , without previously computing the group. We show that every element in the centre is representable by a family of polynomials in Q[x]. For computing such polynomials, we use quadratic Newton-lifting and truncated expressions of the roots of f ove...
متن کاملThe Determination of Galois Groups
A technique is described for the nontentative computer determination of the Galois groups of irreducible polynomials with integer coefficients. The technique for a given polynomial involves finding high-precision approximations to the roots of the polynomial, and fixing an ordering for these roots. The roots are then used to create resolvent polynomials of relatively small degree, the linear fa...
متن کاملAlgebraic properties of a family of Jacobi polynomials
The one-parameter family of polynomials Jn(x, y) = ∑n j=0 ( y+j j ) x is a subfamily of the two-parameter family of Jacobi polynomials. We prove that for each n ≥ 6, the polynomial Jn(x, y0) is irreducible over Q for all but finitely many y0 ∈ Q. If n is odd, then with the exception of a finite set of y0, the Galois group of Jn(x, y0) is Sn; if n is even, then the exceptional set is thin.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 30 شماره
صفحات -
تاریخ انتشار 2000